翻訳と辞書 |
Wolfe conditions : ウィキペディア英語版 | Wolfe conditions In the unconstrained minimization problem, the Wolfe conditions are a set of inequalities for performing inexact line search, especially in quasi-Newton methods, first published by Philip Wolfe in 1969. In these methods the idea is to find :: for some smooth . Each step often involves approximately solving the subproblem :: where is the current best guess, is a search direction, and is the step length. The inexact line searches provide an efficient way of computing an acceptable step length that reduces the objective function 'sufficiently', rather than minimizing the objective function over exactly. A line search algorithm can use Wolfe conditions as a requirement for any guessed , before finding a new search direction . ==Armijo rule and curvature== Denote a univariate function restricted to the direction as . A step length is said to satisfy the ''Wolfe conditions'' if the following two inequalities hold: :i) , :ii) , with 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Wolfe conditions」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|